Biased Initial Distribution for Simulation of Queues with a Superposition of Periodic and Bursty Sources
نویسنده
چکیده
In this paper, we focus on queues with a superposition of periodic and bursty sources where the initial states of the sources are randomly and independently selected. The dynamics of the queue are described as a reducible Markov chain. For such queues, we consider the tail probability of the queue length as the performance measure and try to estimate it by simulations. To do simulation efficiently, we develop a sampling technique which replaces the initial distribution of the reducible Markov chain with a new biased one. Simulation results show that the sampling technique is useful to reduce the variance of the estimates.
منابع مشابه
Finding Good Combinations of Initial Phases for Periodic Sources in Discrete-Time Queues
Our study aims to construct the framework t,o accoinmodate periodic and bursty sources into ATM networks effectively. For this purpose, we develop two effective algorithms which can find a good combination of the initial phases of periodic sources in a short time. We then consider a call admission control (CAC) scheme which controls phase combinations of the periodic sources and decides whether...
متن کاملBounds for the tail distribution in a queue with a superposition of general periodic Markov sources: theory and application
An efficient yet accurate estimation of the tail distribution of the queue length has been considered as one of the most important issues in call admission and congestion controls in ATM networks. The arrival process in ATM networks is essentially a superposition of sources which are typically bursty and periodic either due to their origin or their periodic slot occupation after traffic shaping...
متن کاملBounds for the Tail Distribution in a Queue with the Superposition of General Periodic Markov Sources
In this paper, we derive the bounds formulas for the asymptotic tail distribution in a queue whose arrival process is a superposition of general periodic Markov sources. Note that we make no assumption for the structure of the general periodic Markov sources except that the underlying Markov chains are irreducible. The periodic source model in this paper is thus rather general. Taking initial s...
متن کاملLoss Correlation for Queues with Bursty Input Streams
The loss probability of a queueing system provides, in many cases , insuucient information for performance evaluation, for example , of data link layer protocols and applications with forward error correction. This paper evaluates and characterizes the correlation between packet losses for two queueing systems in discrete time that are motivated by BISDN applications. The rst, a two-class discr...
متن کاملGeometrically batched networks
We develop approximate solutions for the equilibrium queue length probability distribution of queues in open Markovian networks by considering each queue independently, constructing its arrival process as the join of each contributing queue's departing traffic. Without modulation and non-unit batches, we would only need to consider mean internal traffic rates, modelling each queue as M/M/1 to g...
متن کامل